On the sum of reciprocal Tribonacci numbers
نویسنده
چکیده
In this paper we consider infinite sums derived from the reciprocals of the Fibonacci numbers, and infinite sums derived from the reciprocals of the square of the Fibonacci numbers. Applying the floor function to the reciprocals of these sums, we obtain equalities that involve the Fibonacci numbers.
منابع مشابه
More Identities On The Tribonacci Numbers
In this paper, we use a simple method to derive di¤erent recurrence relations on the Tribonacci numbers and their sums. By using the companion matrices and generating matrices, we get more identities on the Tribonacci numbers and their sums, which are more general than that given in literature [E. Kilic, Tribonacci Sequences with Certain Indices and Their Sum, Ars Combinatoria 86 (2008), 13-22....
متن کاملA Complete Categorization of When Generalized Tribonacci Sequences Can Be Avoided by Additive Partitions
A set or sequence U in the natural numbers is defined to be avoidable if N can be partitioned into two sets A and B such that no element of U is the sum of two distinct elements of A or of two distinct elements of B. In 1980, Hoggatt [5] studied the Tribonacci sequence T = {tn} where t1 = 1, t2 = 1, t3 = 2, and tn = tn−1 + tn−2 + tn−3 for n ≥ 4, and showed that it was avoidable. Dumitriu [3] co...
متن کاملMinimal Weight Expansions in Some Pisot Bases
For numeration systems representing real numbers and integers, which are based on Pisot numbers, we study expansions with signed digits which are minimal with respect to the absolute sum of digits. It is proved that these expansions are recognizable by a finite automaton if the base β is the root of a polynomial whose (integer) coefficients satisfy a certain condition (D). When β is the Golden ...
متن کاملA Generalization of the $k$-Bonacci Sequence from Riordan Arrays
In this article, we introduce a family of weighted lattice paths, whose step set is {H = (1, 0), V = (0, 1), D1 = (1, 1), . . . , Dm−1 = (1,m − 1)}. Using these lattice paths, we define a family of Riordan arrays whose sum on the rising diagonal is the k-bonacci sequence. This construction generalizes the Pascal and Delannoy Riordan arrays, whose sum on the rising diagonal is the Fibonacci and ...
متن کاملIncomplete generalized Tribonacci polynomials and numbers
The main object of this paper is to present a systematic investigation of a new class of polynomials – incomplete generalized Tribonacci polynomials and a class of numbers associated with the familiar Tribonacci polynomials. The various results obtained here for these classes of polynomials and numbers include explicit representations, generating functions, recurrence relations and summation fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 98 شماره
صفحات -
تاریخ انتشار 2011